Swan , Jerry and Woodward , John and Özcan , Ender and
نویسندگان
چکیده
We extend a previous mathematical formulation of hyperheuristics to reflect the emerging generalization of the concept. We show that this leads naturally to a recursive definition of hyper-heuristic and to a division of responsibility that is suggestive of a blackboard architecture, in which individual heuristics annotate a workspace with information that may also be of interest to other heuristics. Such a framework invites consideration of the kind of relaxations of the domain barrier that can be achieved without loss of generality.
منابع مشابه
A Comparison of Acceptance Criteria for the Daily Car-Pooling Problem
Previous work on the Daily Car-Pooling problem includes an algorithm that consists of greedy assignment alternating with random perturbation. In this study, we examine the effect of varying the move acceptance policy, specifically Late-acceptance criteria with and without reheating. Late acceptance-based move acceptance criteria were chosen because there is strong empirical evidence in the lite...
متن کاملAugmenting Metaheuristics with Rewriting Systems
We describe the use of a rewriting system to determine equivalence classes over the search-space of optimisation problems. These equivalence classes may be used to derive redundant subsequences in the search-space for incorporation into metaheuristics such as backtracking, genetic algorithms and tabu-search. We use this approach as the basis for a new tabu-search variant — ‘EquationalTS’ and ap...
متن کاملCo-evolving add and delete heuristics
Hyper-heuristics are (meta-)heuristics that operate at a high level to choose or generate a set of low-level (meta-)heuristics to solve difficult search and optimisation problems. Evolutionary algorithms are well-known natureinspired meta-heuristics that simulate Darwinian evolution. In this article, we introduce an evolutionary-based hyper-heuristic in which a set of low-level heuristics compe...
متن کاملA re-characterization of hyper-heuristics
Hyper-heuristics are an optimization methodology which ‘search the space of heuristics’ rather than directly searching the space of the underlying candidate-solution representation. Hyper-heuristic search has traditionally been divided into two layers: a lower problem-domain layer (where domain-specific heuristics are applied) and an upper hyper-heuristic layer, where heuristics are selected or...
متن کاملHyperion - A Recursive Hyper-Heuristic Framework
Hyper-heuristics are methodologies used to search the space of heuristics for solving computationally di cult problems. We describe an object-oriented domain analysis for hyper-heuristics that orthogonally decomposes the domain into generative policy components. The framework facilitates the recursive instantiation of hyper-heuristics over hyper-heuristics, allowing further exploration of the p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016